Efficient labelling algorithms for the maximum noncrossing matching problem
نویسندگان
چکیده
منابع مشابه
1 Efficient labelling algorithms for the Maximum Non Crossing Matching Problem
Consider a bipartite graph; letÕs suppose we draw the origin nodes and the destination nodes arranged in two columns, and the edges as straight line segments. A non crossing matching is a subset of edges such that no two of them intersect. Several algorithms for the problem of finding the non crossing matching of maximum cardinality are proposed. Moreover an extension to weighted graphs is cons...
متن کاملApproximation Algorithms for the Maximum Carpool Matching Problem
The Maximum Carpool Matching problem is a star packing problem in directed graphs. Formally, given a directed graph G = (V,A), a capacity function c : V → N, and a weight function w : A→ R, a feasible carpool matching is a triple (P,D,M), where P (passengers) and D (drivers) form a partition of V , and M is a subset of A∩ (P ×D), under the constraints that for every vertex d ∈ D, deg in(d) ≤ c(...
متن کاملParallel Approximation Algorithms for the Weighted Maximum Matching Problem
We consider the problem of computing a matching in a large weighted graph using a parallel algorithm. Since an exact algorithm for the weighted matching problem is fairly costly we instead develop a fast approximation algorithm. The parallel algorithm is based on a distributed algorithm due to Hoepman [6]. Through experiments using both complete as well as sparse graphs we show that our new alg...
متن کاملLocal Search Algorithms for the Maximum Carpool Matching Problem
The Maximum Carpool Matching problem is a star packing problem in directed graphs. Formally, given a directed graph G = (V,A), a capacity function c : V → N, and a weight function w : A → R+, a carpool matching is a subset of arcs, M ⊆ A, such that every v ∈ V satisfies: (i) din M (v) · dout M (v) = 0, (ii) din M (v) ≤ c(v), and (iii) dout M (v) ≤ 1. A vertex v for which dout M (v) = 1 is a pas...
متن کاملEfficient Algorithms for the Maximum Convex Sum Problem
his research is designed to develop and investigate newly defined problems: the Maximum Convex Sum (MCS), and its generalisation, the K-Maximum Convex Sum (K-MCS), in a two-dimensional (2D) array based on dynamic programming. The study centres on the concept of finding the most useful informative array portion as defined by different parameters involved in data, which is generically expressed i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1993
ISSN: 0166-218X
DOI: 10.1016/0166-218x(93)90090-b